<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>Grupo12daturma2MIEIC4: C:/Users/Paulo/Documents/FEUP/EclipseWorkSpace/calgrafos/src/Graph.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body onload='searchBox.OnSelectItem(0);'>
<!-- Gerado por Doxygen 1.7.4 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'Localizar');
--></script>
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Grupo12daturma2MIEIC4&#160;<span id="projectnumber">1.0</span></div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Página&#160;principal</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Ficheiros</span></a></li>
      <li id="searchli">
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Localizar" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>Lista&#160;de&#160;ficheiros</span></a></li>
      <li><a href="globals.html"><span>Ficheiros&#160;membro</span></a></li>
    </ul>
  </div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
  initNavTree('_graph_8h.html','');
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">C:/Users/Paulo/Documents/FEUP/EclipseWorkSpace/calgrafos/src/Graph.h</div>  </div>
</div>
<div class="contents">
<a href="_graph_8h.html">Ir para a documentação deste ficheiro.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 
<a name="l00002"></a>00002 
<a name="l00007"></a>00007 <span class="preprocessor">#ifndef GRAPH_H_</span>
<a name="l00008"></a>00008 <span class="preprocessor"></span><span class="preprocessor">#define GRAPH_H_</span>
<a name="l00009"></a>00009 <span class="preprocessor"></span>
<a name="l00010"></a>00010 <span class="preprocessor">#include &lt;vector&gt;</span>
<a name="l00011"></a>00011 <span class="preprocessor">#include &lt;queue&gt;</span>
<a name="l00012"></a>00012 <span class="preprocessor">#include &lt;list&gt;</span>
<a name="l00013"></a>00013 <span class="preprocessor">#include &lt;limits&gt;</span>
<a name="l00014"></a>00014 <span class="preprocessor">#include &lt;cmath&gt;</span>
<a name="l00015"></a>00015 <span class="keyword">using namespace </span>std;
<a name="l00016"></a>00016 
<a name="l00017"></a>00017 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt; <span class="keyword">class </span><a class="code" href="class_edge.html">Edge</a>;
<a name="l00018"></a>00018 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt; <span class="keyword">class </span><a class="code" href="class_graph.html">Graph</a>;
<a name="l00019"></a>00019 
<a name="l00020"></a><a class="code" href="_graph_8h.html#aa3df7e773082a47ef6f0d3b9c6e9f5df">00020</a> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="_graph_8h.html#aa3df7e773082a47ef6f0d3b9c6e9f5df">NOT_VISITED</a> = 0;
<a name="l00021"></a><a class="code" href="_graph_8h.html#a9d4d209eba9a9c40a529f914df741241">00021</a> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="_graph_8h.html#a9d4d209eba9a9c40a529f914df741241">BEING_VISITED</a> = 1;
<a name="l00022"></a><a class="code" href="_graph_8h.html#a969ae97a8eee1231386eb0b487abcb9f">00022</a> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="_graph_8h.html#a969ae97a8eee1231386eb0b487abcb9f">DONE_VISITED</a> = 2;
<a name="l00023"></a><a class="code" href="_graph_8h.html#a9fff7b07b84324efa12018456a60d91b">00023</a> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="_graph_8h.html#a9fff7b07b84324efa12018456a60d91b">INT_INFINITY</a> = __INT_MAX__;
<a name="l00024"></a>00024 
<a name="l00025"></a>00025 <span class="comment">/*</span>
<a name="l00026"></a>00026 <span class="comment"> * ================================================================================================</span>
<a name="l00027"></a>00027 <span class="comment"> * Class Vertex</span>
<a name="l00028"></a>00028 <span class="comment"> * ================================================================================================</span>
<a name="l00029"></a>00029 <span class="comment"> */</span>
<a name="l00030"></a>00030 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00031"></a><a class="code" href="class_vertex.html">00031</a> <span class="keyword">class </span><a class="code" href="class_vertex.html">Vertex</a> {
<a name="l00032"></a><a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">00032</a>         T <a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>;
<a name="l00033"></a><a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">00033</a>         vector&lt;Edge&lt;T&gt;  &gt; <a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>;
<a name="l00034"></a><a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">00034</a>         <span class="keywordtype">bool</span> <a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">visited</a>;
<a name="l00035"></a><a class="code" href="class_vertex.html#ae575d4b9a6b1ada3f9626c458c060f54">00035</a>         <span class="keywordtype">bool</span> <a class="code" href="class_vertex.html#ae575d4b9a6b1ada3f9626c458c060f54">processing</a>;
<a name="l00036"></a><a class="code" href="class_vertex.html#ab29ac1b694fc673ba26cfc6d3e9bda13">00036</a>         <span class="keywordtype">int</span> <a class="code" href="class_vertex.html#ab29ac1b694fc673ba26cfc6d3e9bda13">indegree</a>;
<a name="l00037"></a><a class="code" href="class_vertex.html#ab2e06daa1acc81f7bd75f3d45c73a49a">00037</a>         <span class="keywordtype">int</span> <a class="code" href="class_vertex.html#ab2e06daa1acc81f7bd75f3d45c73a49a">dist</a>;
<a name="l00038"></a>00038 <span class="keyword">public</span>:
<a name="l00039"></a>00039 
<a name="l00040"></a>00040         <a class="code" href="class_vertex.html">Vertex</a>(T in);
<a name="l00041"></a><a class="code" href="class_vertex.html#aefa9b76cd57411c5354e5620dc2d84dd">00041</a>         <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="class_graph.html">Graph</a>&lt;T&gt;;
<a name="l00042"></a>00042 
<a name="l00043"></a>00043         <span class="keywordtype">void</span> <a class="code" href="class_graph.html#ac61af3aafe6277215f5a3b3cc7d58ce2">addEdge</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *dest, <span class="keywordtype">double</span> w);
<a name="l00044"></a>00044         <span class="keywordtype">bool</span> removeEdgeTo(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *d);
<a name="l00045"></a>00045 
<a name="l00046"></a>00046         T getInfo() <span class="keyword">const</span>;
<a name="l00047"></a>00047         <span class="keywordtype">void</span> setInfo(T info);
<a name="l00048"></a>00048 
<a name="l00049"></a>00049         <span class="keywordtype">int</span> getDist() <span class="keyword">const</span>;
<a name="l00050"></a>00050         <span class="keywordtype">int</span> getIndegree() <span class="keyword">const</span>;
<a name="l00051"></a>00051 
<a name="l00052"></a>00052         <span class="keywordtype">bool</span> operator&lt;(const Vertex&lt;T&gt; vertex);
<a name="l00053"></a>00053 
<a name="l00054"></a><a class="code" href="class_vertex.html#abd40febd917aa25add6bd42237c8463a">00054</a>         <a class="code" href="class_vertex.html">Vertex</a>* <a class="code" href="class_vertex.html#abd40febd917aa25add6bd42237c8463a">path</a>;
<a name="l00055"></a>00055 };
<a name="l00056"></a>00056 
<a name="l00057"></a>00057 
<a name="l00058"></a>00058 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00059"></a><a class="code" href="structvertex__greater__than.html">00059</a> <span class="keyword">struct </span><a class="code" href="structvertex__greater__than.html">vertex_greater_than</a> {
<a name="l00060"></a><a class="code" href="structvertex__greater__than.html#af58940d572829488c2915ca53663631e">00060</a>     <span class="keywordtype">bool</span> <a class="code" href="structvertex__greater__than.html#af58940d572829488c2915ca53663631e">operator()</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> * a, <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> * b)<span class="keyword"> const </span>{
<a name="l00061"></a>00061         <span class="keywordflow">return</span> a-&gt;<a class="code" href="class_vertex.html#a3379c6cbcf1eaacc098381e3557a0b52">getDist</a>() &gt; b-&gt;<a class="code" href="class_vertex.html#a3379c6cbcf1eaacc098381e3557a0b52">getDist</a>();
<a name="l00062"></a>00062     }
<a name="l00063"></a>00063 };
<a name="l00064"></a>00064 
<a name="l00065"></a>00065 
<a name="l00066"></a>00066 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00067"></a><a class="code" href="class_vertex.html#ab2b5b43fb1709a901b78718436763a84">00067</a> <span class="keywordtype">bool</span> <a class="code" href="class_vertex.html">Vertex&lt;T&gt;::removeEdgeTo</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *d) {
<a name="l00068"></a>00068         d-&gt;<a class="code" href="class_vertex.html#ab29ac1b694fc673ba26cfc6d3e9bda13">indegree</a>--; <span class="comment">//adicionado do exercicio 5</span>
<a name="l00069"></a>00069         <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator it= adj.begin();
<a name="l00070"></a>00070         <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator ite= adj.end();
<a name="l00071"></a>00071         <span class="keywordflow">while</span> (it!=ite) {
<a name="l00072"></a>00072                 <span class="keywordflow">if</span> (it-&gt;dest == d) {
<a name="l00073"></a>00073                         adj.erase(it);
<a name="l00074"></a>00074                         <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00075"></a>00075                 }
<a name="l00076"></a>00076                 <span class="keywordflow">else</span> it++;
<a name="l00077"></a>00077         }
<a name="l00078"></a>00078         <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00079"></a>00079 }
<a name="l00080"></a>00080 
<a name="l00081"></a>00081 <span class="comment">//actualizado pelo exerc�cio 5</span>
<a name="l00082"></a>00082 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00083"></a><a class="code" href="class_vertex.html#afcbdd4d4198b672356559cb8fa088408">00083</a> <a class="code" href="class_vertex.html">Vertex&lt;T&gt;::Vertex</a>(T in): info(in), visited(false), processing(false), indegree(0), dist(0) {
<a name="l00084"></a>00084         <a class="code" href="class_vertex.html#abd40febd917aa25add6bd42237c8463a">path</a> = NULL;
<a name="l00085"></a>00085 }
<a name="l00086"></a>00086 
<a name="l00087"></a>00087 
<a name="l00088"></a>00088 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00089"></a><a class="code" href="class_vertex.html#aeb024eced2da142912f189af6a454db3">00089</a> <span class="keywordtype">void</span> <a class="code" href="class_vertex.html#aeb024eced2da142912f189af6a454db3">Vertex&lt;T&gt;::addEdge</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *dest, <span class="keywordtype">double</span> w) {
<a name="l00090"></a>00090         <a class="code" href="class_edge.html">Edge&lt;T&gt;</a> edgeD(dest,w);
<a name="l00091"></a>00091         adj.push_back(edgeD);
<a name="l00092"></a>00092 }
<a name="l00093"></a>00093 
<a name="l00094"></a>00094 <span class="comment">//--</span>
<a name="l00095"></a>00095 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00096"></a><a class="code" href="class_vertex.html#a5880b4b252ae6818819c2f9645784b59">00096</a> T <a class="code" href="class_vertex.html#a5880b4b252ae6818819c2f9645784b59">Vertex&lt;T&gt;::getInfo</a>()<span class="keyword"> const </span>{
<a name="l00097"></a>00097         <span class="keywordflow">return</span> this-&gt;info;
<a name="l00098"></a>00098 }
<a name="l00099"></a>00099 
<a name="l00100"></a>00100 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00101"></a><a class="code" href="class_vertex.html#a3379c6cbcf1eaacc098381e3557a0b52">00101</a> <span class="keywordtype">int</span> <a class="code" href="class_vertex.html#a3379c6cbcf1eaacc098381e3557a0b52">Vertex&lt;T&gt;::getDist</a>()<span class="keyword"> const </span>{
<a name="l00102"></a>00102         <span class="keywordflow">return</span> this-&gt;dist;
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104 
<a name="l00105"></a>00105 
<a name="l00106"></a>00106 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00107"></a><a class="code" href="class_vertex.html#a31cd60c26640f8072a928ba70eb2f95e">00107</a> <span class="keywordtype">void</span> <a class="code" href="class_vertex.html#a31cd60c26640f8072a928ba70eb2f95e">Vertex&lt;T&gt;::setInfo</a>(T info) {
<a name="l00108"></a>00108         this-&gt;info = info;
<a name="l00109"></a>00109 }
<a name="l00110"></a>00110 
<a name="l00111"></a>00111 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00112"></a><a class="code" href="class_vertex.html#a305ef01582f945f22134abb9294fe1f3">00112</a> <span class="keywordtype">int</span> <a class="code" href="class_vertex.html#a305ef01582f945f22134abb9294fe1f3">Vertex&lt;T&gt;::getIndegree</a>()<span class="keyword"> const </span>{
<a name="l00113"></a>00113         <span class="keywordflow">return</span> this-&gt;indegree;
<a name="l00114"></a>00114 }
<a name="l00115"></a>00115 
<a name="l00116"></a>00116 
<a name="l00117"></a>00117 
<a name="l00118"></a>00118 
<a name="l00119"></a>00119 <span class="comment">/* ================================================================================================</span>
<a name="l00120"></a>00120 <span class="comment"> * Class Edge</span>
<a name="l00121"></a>00121 <span class="comment"> * ================================================================================================</span>
<a name="l00122"></a>00122 <span class="comment"> */</span>
<a name="l00123"></a>00123 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00124"></a><a class="code" href="class_edge.html">00124</a> <span class="keyword">class </span><a class="code" href="class_edge.html">Edge</a> {
<a name="l00125"></a><a class="code" href="class_edge.html#ae4d65678b91bd9d814af4720ad87cd0c">00125</a>         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> * <a class="code" href="class_edge.html#ae4d65678b91bd9d814af4720ad87cd0c">dest</a>;
<a name="l00126"></a><a class="code" href="class_edge.html#af188b57b604f0d65e2da48733bd76426">00126</a>         <span class="keywordtype">double</span> <a class="code" href="class_edge.html#af188b57b604f0d65e2da48733bd76426">weight</a>;
<a name="l00127"></a>00127 <span class="keyword">public</span>:
<a name="l00128"></a>00128         <a class="code" href="class_edge.html#a9da861a03f920c89984be33515a5d870">Edge</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *d, <span class="keywordtype">double</span> w);
<a name="l00129"></a><a class="code" href="class_edge.html#aefa9b76cd57411c5354e5620dc2d84dd">00129</a>         <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="class_graph.html">Graph</a>&lt;T&gt;;
<a name="l00130"></a><a class="code" href="class_edge.html#a2e120a12dec663fa334633b4f26cbed8">00130</a>         <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="class_vertex.html">Vertex</a>&lt;T&gt;;
<a name="l00131"></a>00131 };
<a name="l00132"></a>00132 
<a name="l00133"></a>00133 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00134"></a><a class="code" href="class_edge.html#a9da861a03f920c89984be33515a5d870">00134</a> <a class="code" href="class_edge.html#a9da861a03f920c89984be33515a5d870">Edge&lt;T&gt;::Edge</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *d, <span class="keywordtype">double</span> w): dest(d), weight(w){}
<a name="l00135"></a>00135 
<a name="l00136"></a>00136 
<a name="l00137"></a>00137 
<a name="l00138"></a>00138 
<a name="l00139"></a>00139 
<a name="l00140"></a>00140 <span class="comment">/* ================================================================================================</span>
<a name="l00141"></a>00141 <span class="comment"> * Class Graph</span>
<a name="l00142"></a>00142 <span class="comment"> * ================================================================================================</span>
<a name="l00143"></a>00143 <span class="comment"> */</span>
<a name="l00144"></a>00144 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00145"></a><a class="code" href="class_graph.html">00145</a> <span class="keyword">class </span><a class="code" href="class_graph.html">Graph</a> {
<a name="l00146"></a><a class="code" href="class_graph.html#a73d4e735fc0a7c83c9c689a2b53fa623">00146</a>         vector&lt;Vertex&lt;T&gt; *&gt; <a class="code" href="class_graph.html#a73d4e735fc0a7c83c9c689a2b53fa623">vertexSet</a>;
<a name="l00147"></a>00147         <span class="keywordtype">void</span> <a class="code" href="class_graph.html#a3f62ba0e37c5c011299c93d60e3a8be3">dfs</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v, vector&lt;T&gt; &amp;res) <span class="keyword">const</span>;
<a name="l00148"></a>00148 
<a name="l00149"></a>00149         <span class="comment">//Exercicio 5</span>
<a name="l00150"></a><a class="code" href="class_graph.html#ad5cc402f1b24d30ae12ffc2622ffbd5f">00150</a>         <span class="keywordtype">int</span> <a class="code" href="class_graph.html#ad5cc402f1b24d30ae12ffc2622ffbd5f">numCycles</a>;
<a name="l00151"></a>00151         <span class="keywordtype">void</span> <a class="code" href="class_graph.html#a4d5abd78dd24ea71dbf50e1b0284d4b3">dfsVisit</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v);
<a name="l00152"></a>00152         <span class="keywordtype">void</span> <a class="code" href="class_graph.html#a4d5abd78dd24ea71dbf50e1b0284d4b3">dfsVisit</a>();
<a name="l00153"></a>00153         <span class="keywordtype">void</span> <a class="code" href="class_graph.html#ac08257ce8a96a8b4e44f1818e5eb8cf9">getPathTo</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *origin, list&lt;T&gt; &amp;res);
<a name="l00154"></a>00154 
<a name="l00155"></a>00155         <span class="comment">//Exercicio 6</span>
<a name="l00156"></a><a class="code" href="class_graph.html#aeae5c7d16f72e3d0eeccfecab73c03d1">00156</a>         <span class="keywordtype">int</span> ** <a class="code" href="class_graph.html#aeae5c7d16f72e3d0eeccfecab73c03d1">pathArray</a>;
<a name="l00157"></a><a class="code" href="class_graph.html#a895cdb5e933a2a6a6fa7e1623f839f61">00157</a>         <span class="keywordtype">int</span> ** <a class="code" href="class_graph.html#a895cdb5e933a2a6a6fa7e1623f839f61">pathArrayAux</a>;
<a name="l00158"></a>00158 
<a name="l00159"></a>00159 <span class="keyword">public</span>:
<a name="l00160"></a>00160         <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#a00be284ea2be3b3d0f0d2e493b70245b">addVertex</a>(<span class="keyword">const</span> T &amp;in);
<a name="l00161"></a>00161         <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#ac61af3aafe6277215f5a3b3cc7d58ce2">addEdge</a>(<span class="keyword">const</span> T &amp;sourc, <span class="keyword">const</span> T &amp;dest, <span class="keywordtype">double</span> w);
<a name="l00162"></a>00162         <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#af9c903104ad69a7782979fa9caedf163">removeVertex</a>(<span class="keyword">const</span> T &amp;in);
<a name="l00163"></a>00163         <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#a1106092a37366486cf55576f9ec01692">removeEdge</a>(<span class="keyword">const</span> T &amp;sourc, <span class="keyword">const</span> T &amp;dest);
<a name="l00164"></a>00164         vector&lt;T&gt; <a class="code" href="class_graph.html#a3f62ba0e37c5c011299c93d60e3a8be3">dfs</a>() <span class="keyword">const</span>;
<a name="l00165"></a>00165         vector&lt;T&gt; <a class="code" href="class_graph.html#a0e9598b98be2570eb432690411a577e8">bfs</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v) <span class="keyword">const</span>;
<a name="l00166"></a>00166         <span class="keywordtype">int</span> <a class="code" href="class_graph.html#ab8fd74c3cf8dca6eaa82d39fd1216f52">maxNewChildren</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v, T &amp;inf) <span class="keyword">const</span>;
<a name="l00167"></a>00167         vector&lt;Vertex&lt;T&gt; * &gt; <a class="code" href="class_graph.html#ab7dc5ec1c34df811d560021b726e95ec">getVertexSet</a>() <span class="keyword">const</span>;
<a name="l00168"></a>00168         <span class="keywordtype">int</span> <a class="code" href="class_graph.html#a295932f117d92c825a97ec458e0fb332">getNumVertex</a>() <span class="keyword">const</span>;
<a name="l00169"></a>00169 
<a name="l00170"></a>00170         <span class="comment">//Exerc�cio 5</span>
<a name="l00171"></a>00171         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a>* <a class="code" href="class_graph.html#a08a95472b0d9bd7321660940807af060">getVertex</a>(<span class="keyword">const</span> T &amp;v) <span class="keyword">const</span>;
<a name="l00172"></a>00172         <span class="keywordtype">void</span> <a class="code" href="class_graph.html#af34eb86d804272e6e3e221a9ed688c53">resetIndegrees</a>();
<a name="l00173"></a>00173         vector&lt;Vertex&lt;T&gt;*&gt; <a class="code" href="class_graph.html#aa1a3c754f51a888e25dff2b26dfb85fc">getSources</a>() <span class="keyword">const</span>;
<a name="l00174"></a>00174         <span class="keywordtype">int</span> <a class="code" href="class_graph.html#a694dff81073c38b669057f0c6bd4cbb1">getNumCycles</a>();
<a name="l00175"></a>00175         vector&lt;T&gt; <a class="code" href="class_graph.html#a2e75512c089c3916dda9cf61e1185d9d">topologicalOrder</a>();
<a name="l00176"></a>00176         vector&lt;T&gt; <a class="code" href="class_graph.html#ab4054ca572c10669dd3e05d6d41c116c">getPath</a>(<span class="keyword">const</span> T &amp;origin, <span class="keyword">const</span> T &amp;dest);
<a name="l00177"></a>00177         <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#ab49d07c2bd6b8b30d5ae82bc558b821a">isDAG</a>();
<a name="l00178"></a>00178 
<a name="l00179"></a>00179         <span class="keywordtype">void</span> <a class="code" href="class_graph.html#a445a38cf4045797198eae2b818b602de">dijkstraShortestPath</a>(<span class="keyword">const</span> T &amp;s);
<a name="l00180"></a>00180         <span class="keywordtype">int</span> <a class="code" href="class_graph.html#a7e137f1ef838395ac1044a944fa54448">edgeCost</a>(<span class="keywordtype">int</span> vOrigIndex, <span class="keywordtype">int</span> vDestIndex);
<a name="l00181"></a>00181 };
<a name="l00182"></a>00182 
<a name="l00183"></a>00183 <span class="comment">//---</span>
<a name="l00184"></a>00184 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00185"></a><a class="code" href="class_graph.html#a295932f117d92c825a97ec458e0fb332">00185</a> <span class="keywordtype">int</span> <a class="code" href="class_graph.html#a295932f117d92c825a97ec458e0fb332">Graph&lt;T&gt;::getNumVertex</a>()<span class="keyword"> const </span>{
<a name="l00186"></a>00186         <span class="keywordflow">return</span> vertexSet.size();
<a name="l00187"></a>00187 }
<a name="l00188"></a>00188 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00189"></a><a class="code" href="class_graph.html#ab7dc5ec1c34df811d560021b726e95ec">00189</a> vector&lt;Vertex&lt;T&gt; * &gt; <a class="code" href="class_graph.html#ab7dc5ec1c34df811d560021b726e95ec">Graph&lt;T&gt;::getVertexSet</a>()<span class="keyword"> const </span>{
<a name="l00190"></a>00190         <span class="keywordflow">return</span> vertexSet;
<a name="l00191"></a>00191 }
<a name="l00192"></a>00192 
<a name="l00193"></a>00193 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00194"></a><a class="code" href="class_graph.html#a694dff81073c38b669057f0c6bd4cbb1">00194</a> <span class="keywordtype">int</span> <a class="code" href="class_graph.html#a694dff81073c38b669057f0c6bd4cbb1">Graph&lt;T&gt;::getNumCycles</a>() {
<a name="l00195"></a>00195         numCycles = 0;
<a name="l00196"></a>00196         dfsVisit();
<a name="l00197"></a>00197         <span class="keywordflow">return</span> this-&gt;numCycles;
<a name="l00198"></a>00198 }
<a name="l00199"></a>00199 
<a name="l00200"></a>00200 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00201"></a><a class="code" href="class_graph.html#ab49d07c2bd6b8b30d5ae82bc558b821a">00201</a> <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#ab49d07c2bd6b8b30d5ae82bc558b821a">Graph&lt;T&gt;::isDAG</a>() {
<a name="l00202"></a>00202         <span class="keywordflow">return</span> (getNumCycles() == 0);
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204 
<a name="l00205"></a>00205 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00206"></a><a class="code" href="class_graph.html#a00be284ea2be3b3d0f0d2e493b70245b">00206</a> <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#a00be284ea2be3b3d0f0d2e493b70245b">Graph&lt;T&gt;::addVertex</a>(<span class="keyword">const</span> T &amp;in) {
<a name="l00207"></a>00207         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator it= vertexSet.begin();
<a name="l00208"></a>00208         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator ite= vertexSet.end();
<a name="l00209"></a>00209         <span class="keywordflow">for</span> (; it!=ite; it++)
<a name="l00210"></a>00210                 <span class="keywordflow">if</span> ((*it)-&gt;info == in) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00211"></a>00211         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v1 = <span class="keyword">new</span> <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a>(in);
<a name="l00212"></a>00212         vertexSet.push_back(v1);
<a name="l00213"></a>00213         <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00214"></a>00214 }
<a name="l00215"></a>00215 
<a name="l00216"></a>00216 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00217"></a><a class="code" href="class_graph.html#af9c903104ad69a7782979fa9caedf163">00217</a> <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#af9c903104ad69a7782979fa9caedf163">Graph&lt;T&gt;::removeVertex</a>(<span class="keyword">const</span> T &amp;in) {
<a name="l00218"></a>00218         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator it= vertexSet.begin();
<a name="l00219"></a>00219         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator ite= vertexSet.end();
<a name="l00220"></a>00220         <span class="keywordflow">for</span> (; it!=ite; it++) {
<a name="l00221"></a>00221                 <span class="keywordflow">if</span> ((*it)-&gt;info == in) {
<a name="l00222"></a>00222                         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> * v= *it;
<a name="l00223"></a>00223                         vertexSet.erase(it);
<a name="l00224"></a>00224                         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator it1= vertexSet.begin();
<a name="l00225"></a>00225                         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator it1e= vertexSet.end();
<a name="l00226"></a>00226                         <span class="keywordflow">for</span> (; it1!=it1e; it1++) {
<a name="l00227"></a>00227                                 (*it1)-&gt;<a class="code" href="class_vertex.html#ab2b5b43fb1709a901b78718436763a84">removeEdgeTo</a>(v);
<a name="l00228"></a>00228                         }
<a name="l00229"></a>00229 
<a name="l00230"></a>00230                         <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator itAdj= v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>.begin();
<a name="l00231"></a>00231                         <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator itAdje= v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>.end();
<a name="l00232"></a>00232                         <span class="keywordflow">for</span> (; itAdj!=itAdje; itAdj++) {
<a name="l00233"></a>00233                                 itAdj-&gt;dest-&gt;indegree--;
<a name="l00234"></a>00234                         }
<a name="l00235"></a>00235                         <span class="keyword">delete</span> v;
<a name="l00236"></a>00236                         <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00237"></a>00237                 }
<a name="l00238"></a>00238         }
<a name="l00239"></a>00239         <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00240"></a>00240 }
<a name="l00241"></a>00241 
<a name="l00242"></a>00242 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00243"></a><a class="code" href="class_graph.html#ac61af3aafe6277215f5a3b3cc7d58ce2">00243</a> <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#ac61af3aafe6277215f5a3b3cc7d58ce2">Graph&lt;T&gt;::addEdge</a>(<span class="keyword">const</span> T &amp;sourc, <span class="keyword">const</span> T &amp;dest, <span class="keywordtype">double</span> w) {
<a name="l00244"></a>00244         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator it= vertexSet.begin();
<a name="l00245"></a>00245         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator ite= vertexSet.end();
<a name="l00246"></a>00246         <span class="keywordtype">int</span> found=0;
<a name="l00247"></a>00247         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *edgeS, *edgeD;
<a name="l00248"></a>00248         <span class="keywordflow">while</span> (found!=2 &amp;&amp; it!=ite ) {
<a name="l00249"></a>00249                 <span class="keywordflow">if</span> ( (*it)-&gt;info == sourc )
<a name="l00250"></a>00250                         { edgeS=*it; found++;}
<a name="l00251"></a>00251                 <span class="keywordflow">if</span> ( (*it)-&gt;info == dest )
<a name="l00252"></a>00252                         { edgeD=*it; found++;}
<a name="l00253"></a>00253                 it ++;
<a name="l00254"></a>00254         }
<a name="l00255"></a>00255         <span class="keywordflow">if</span> (found!=2) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00256"></a>00256         edgeD-&gt;<a class="code" href="class_vertex.html#ab29ac1b694fc673ba26cfc6d3e9bda13">indegree</a>++;
<a name="l00257"></a>00257 
<a name="l00258"></a>00258         edgeS-&gt;<a class="code" href="class_vertex.html#aeb024eced2da142912f189af6a454db3">addEdge</a>(edgeD,w);
<a name="l00259"></a>00259 
<a name="l00260"></a>00260         <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00261"></a>00261 }
<a name="l00262"></a>00262 
<a name="l00263"></a>00263 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00264"></a><a class="code" href="class_graph.html#a1106092a37366486cf55576f9ec01692">00264</a> <span class="keywordtype">bool</span> <a class="code" href="class_graph.html#a1106092a37366486cf55576f9ec01692">Graph&lt;T&gt;::removeEdge</a>(<span class="keyword">const</span> T &amp;sourc, <span class="keyword">const</span> T &amp;dest) {
<a name="l00265"></a>00265         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator it= vertexSet.begin();
<a name="l00266"></a>00266         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::iterator ite= vertexSet.end();
<a name="l00267"></a>00267         <span class="keywordtype">int</span> found=0;
<a name="l00268"></a>00268         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *edgeS, *edgeD;
<a name="l00269"></a>00269         <span class="keywordflow">while</span> (found!=2 &amp;&amp; it!=ite ) {
<a name="l00270"></a>00270                 <span class="keywordflow">if</span> ( (*it)-&gt;info == sourc )
<a name="l00271"></a>00271                         { edgeS=*it; found++;}
<a name="l00272"></a>00272                 <span class="keywordflow">if</span> ( (*it)-&gt;info == dest )
<a name="l00273"></a>00273                         { edgeD=*it; found++;}
<a name="l00274"></a>00274                 it ++;
<a name="l00275"></a>00275         }
<a name="l00276"></a>00276         <span class="keywordflow">if</span> (found!=2)
<a name="l00277"></a>00277                 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00278"></a>00278 
<a name="l00279"></a>00279         edgeD-&gt;<a class="code" href="class_vertex.html#ab29ac1b694fc673ba26cfc6d3e9bda13">indegree</a>--;
<a name="l00280"></a>00280 
<a name="l00281"></a>00281         <span class="keywordflow">return</span> edgeS-&gt;<a class="code" href="class_vertex.html#ab2b5b43fb1709a901b78718436763a84">removeEdgeTo</a>(edgeD);
<a name="l00282"></a>00282 }
<a name="l00283"></a>00283 
<a name="l00284"></a>00284 
<a name="l00285"></a>00285 
<a name="l00286"></a>00286 
<a name="l00287"></a>00287 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00288"></a><a class="code" href="class_graph.html#a3f62ba0e37c5c011299c93d60e3a8be3">00288</a> vector&lt;T&gt; <a class="code" href="class_graph.html#a3f62ba0e37c5c011299c93d60e3a8be3">Graph&lt;T&gt;::dfs</a>()<span class="keyword"> const </span>{
<a name="l00289"></a>00289         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::const_iterator it= vertexSet.begin();
<a name="l00290"></a>00290         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::const_iterator ite= vertexSet.end();
<a name="l00291"></a>00291         <span class="keywordflow">for</span> (; it !=ite; it++)
<a name="l00292"></a>00292                 (*it)-&gt;visited=<span class="keyword">false</span>;
<a name="l00293"></a>00293         vector&lt;T&gt; res;
<a name="l00294"></a>00294         it=vertexSet.begin();
<a name="l00295"></a>00295         <span class="keywordflow">for</span> (; it !=ite; it++)
<a name="l00296"></a>00296             <span class="keywordflow">if</span> ( (*it)-&gt;visited==<span class="keyword">false</span> )
<a name="l00297"></a>00297                 dfs(*it,res);
<a name="l00298"></a>00298         <span class="keywordflow">return</span> res;
<a name="l00299"></a>00299 }
<a name="l00300"></a>00300 
<a name="l00301"></a>00301 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00302"></a><a class="code" href="class_graph.html#a3a36cb674c974bac7181095509a73ee7">00302</a> <span class="keywordtype">void</span> <a class="code" href="class_graph.html#a3f62ba0e37c5c011299c93d60e3a8be3">Graph&lt;T&gt;::dfs</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v,vector&lt;T&gt; &amp;res)<span class="keyword"> const </span>{
<a name="l00303"></a>00303         v-&gt;<a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">visited</a> = <span class="keyword">true</span>;
<a name="l00304"></a>00304         res.push_back(v-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>);
<a name="l00305"></a>00305         <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator it= (v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>).begin();
<a name="l00306"></a>00306         <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator ite= (v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>).end();
<a name="l00307"></a>00307         <span class="keywordflow">for</span> (; it !=ite; it++)
<a name="l00308"></a>00308             <span class="keywordflow">if</span> ( it-&gt;dest-&gt;visited == <span class="keyword">false</span> ){
<a name="l00309"></a>00309                 <span class="comment">//cout &lt;&lt; &quot;ok &quot;;</span>
<a name="l00310"></a>00310                 dfs(it-&gt;dest, res);
<a name="l00311"></a>00311             }
<a name="l00312"></a>00312 }
<a name="l00313"></a>00313 
<a name="l00314"></a>00314 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00315"></a><a class="code" href="class_graph.html#a0e9598b98be2570eb432690411a577e8">00315</a> vector&lt;T&gt; <a class="code" href="class_graph.html#a0e9598b98be2570eb432690411a577e8">Graph&lt;T&gt;::bfs</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v)<span class="keyword"> const </span>{
<a name="l00316"></a>00316         vector&lt;T&gt; res;
<a name="l00317"></a>00317         queue&lt;Vertex&lt;T&gt; *&gt; q;
<a name="l00318"></a>00318         q.push(v);
<a name="l00319"></a>00319         v-&gt;<a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">visited</a> = <span class="keyword">true</span>;
<a name="l00320"></a>00320         <span class="keywordflow">while</span> (!q.empty()) {
<a name="l00321"></a>00321                 <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v1 = q.front();
<a name="l00322"></a>00322                 q.pop();
<a name="l00323"></a>00323                 res.push_back(v1-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>);
<a name="l00324"></a>00324                 <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator it=v1-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>.begin();
<a name="l00325"></a>00325                 <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator ite=v1-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>.end();
<a name="l00326"></a>00326                 <span class="keywordflow">for</span> (; it!=ite; it++) {
<a name="l00327"></a>00327                         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *d = it-&gt;dest;
<a name="l00328"></a>00328                         <span class="keywordflow">if</span> (d-&gt;<a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">visited</a>==<span class="keyword">false</span>) {
<a name="l00329"></a>00329                                 d-&gt;<a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">visited</a>=<span class="keyword">true</span>;
<a name="l00330"></a>00330                                 q.push(d);
<a name="l00331"></a>00331                         }
<a name="l00332"></a>00332                 }
<a name="l00333"></a>00333         }
<a name="l00334"></a>00334         <span class="keywordflow">return</span> res;
<a name="l00335"></a>00335 }
<a name="l00336"></a>00336 
<a name="l00337"></a>00337 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00338"></a><a class="code" href="class_graph.html#ab8fd74c3cf8dca6eaa82d39fd1216f52">00338</a> <span class="keywordtype">int</span> <a class="code" href="class_graph.html#ab8fd74c3cf8dca6eaa82d39fd1216f52">Graph&lt;T&gt;::maxNewChildren</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v, T &amp;inf)<span class="keyword"> const </span>{
<a name="l00339"></a>00339         vector&lt;T&gt; res;
<a name="l00340"></a>00340         queue&lt;Vertex&lt;T&gt; *&gt; q;
<a name="l00341"></a>00341         queue&lt;int&gt; level;
<a name="l00342"></a>00342         <span class="keywordtype">int</span> maxChildren=0;
<a name="l00343"></a>00343         inf =v-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>;
<a name="l00344"></a>00344         q.push(v);
<a name="l00345"></a>00345         level.push(0);
<a name="l00346"></a>00346         v-&gt;<a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">visited</a> = <span class="keyword">true</span>;
<a name="l00347"></a>00347         <span class="keywordflow">while</span> (!q.empty()) {
<a name="l00348"></a>00348                 <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v1 = q.front();
<a name="l00349"></a>00349                 q.pop();
<a name="l00350"></a>00350                 res.push_back(v1-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>);
<a name="l00351"></a>00351                 <span class="keywordtype">int</span> l=level.front();
<a name="l00352"></a>00352                 level.pop(); l++;
<a name="l00353"></a>00353                 <span class="keywordtype">int</span> nChildren=0;
<a name="l00354"></a>00354                 <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator it=v1-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>.begin();
<a name="l00355"></a>00355                 <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator ite=v1-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>.end();
<a name="l00356"></a>00356                 <span class="keywordflow">for</span> (; it!=ite; it++) {
<a name="l00357"></a>00357                         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *d = it-&gt;dest;
<a name="l00358"></a>00358                         <span class="keywordflow">if</span> (d-&gt;<a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">visited</a>==<span class="keyword">false</span>) {
<a name="l00359"></a>00359                                 d-&gt;<a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">visited</a>=<span class="keyword">true</span>;
<a name="l00360"></a>00360                                 q.push(d);
<a name="l00361"></a>00361                                 level.push(l);
<a name="l00362"></a>00362                                 nChildren++;
<a name="l00363"></a>00363                         }
<a name="l00364"></a>00364                 }
<a name="l00365"></a>00365                 <span class="keywordflow">if</span> (nChildren&gt;maxChildren) {
<a name="l00366"></a>00366                         maxChildren=nChildren;
<a name="l00367"></a>00367                         inf = v1-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>;
<a name="l00368"></a>00368                 }
<a name="l00369"></a>00369         }
<a name="l00370"></a>00370         <span class="keywordflow">return</span> maxChildren;
<a name="l00371"></a>00371 }
<a name="l00372"></a>00372 
<a name="l00373"></a>00373 <span class="comment">//****</span>
<a name="l00374"></a>00374 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00375"></a><a class="code" href="class_graph.html#a08a95472b0d9bd7321660940807af060">00375</a> <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a>* <a class="code" href="class_graph.html#a08a95472b0d9bd7321660940807af060">Graph&lt;T&gt;::getVertex</a>(<span class="keyword">const</span> T &amp;v)<span class="keyword"> const </span>{
<a name="l00376"></a>00376         <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; vertexSet.size(); i++)
<a name="l00377"></a>00377                 <span class="keywordflow">if</span> (vertexSet[i]-&gt;info == v) <span class="keywordflow">return</span> vertexSet[i];
<a name="l00378"></a>00378         <span class="keywordflow">return</span> NULL;
<a name="l00379"></a>00379 }
<a name="l00380"></a>00380 
<a name="l00381"></a>00381 <span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;
<a name="l00382"></a><a class="code" href="class_graph.html#af34eb86d804272e6e3e221a9ed688c53">00382</a> <span class="keywordtype">void</span> <a class="code" href="class_graph.html#af34eb86d804272e6e3e221a9ed688c53">Graph&lt;T&gt;::resetIndegrees</a>() {
<a name="l00383"></a>00383         <span class="comment">//colocar todos os indegree em 0;</span>
<a name="l00384"></a>00384         <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; vertexSet.size(); i++) vertexSet[i]-&gt;indegree = 0;
<a name="l00385"></a>00385 
<a name="l00386"></a>00386         <span class="comment">//actualizar os indegree</span>
<a name="l00387"></a>00387         <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; vertexSet.size(); i++) {
<a name="l00388"></a>00388                 <span class="comment">//percorrer o vector de Edges, e actualizar indegree</span>
<a name="l00389"></a>00389                 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j = 0; j &lt; vertexSet[i]-&gt;adj.size(); j++) {
<a name="l00390"></a>00390                         vertexSet[i]-&gt;adj[j].dest-&gt;indegree++;
<a name="l00391"></a>00391                 }
<a name="l00392"></a>00392         }
<a name="l00393"></a>00393 }
<a name="l00394"></a>00394 
<a name="l00395"></a>00395 
<a name="l00396"></a>00396 <span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;
<a name="l00397"></a><a class="code" href="class_graph.html#aa1a3c754f51a888e25dff2b26dfb85fc">00397</a> vector&lt;Vertex&lt;T&gt;*&gt; <a class="code" href="class_graph.html#aa1a3c754f51a888e25dff2b26dfb85fc">Graph&lt;T&gt;::getSources</a>()<span class="keyword"> const </span>{
<a name="l00398"></a>00398         vector&lt; Vertex&lt;T&gt;* &gt; buffer;
<a name="l00399"></a>00399         <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; vertexSet.size(); i++) {
<a name="l00400"></a>00400                 <span class="keywordflow">if</span>( vertexSet[i]-&gt;indegree == 0 ) buffer.push_back( vertexSet[i] );
<a name="l00401"></a>00401         }
<a name="l00402"></a>00402         <span class="keywordflow">return</span> buffer;
<a name="l00403"></a>00403 }
<a name="l00404"></a>00404 
<a name="l00405"></a>00405 
<a name="l00406"></a>00406 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00407"></a><a class="code" href="class_graph.html#a4d5abd78dd24ea71dbf50e1b0284d4b3">00407</a> <span class="keywordtype">void</span> <a class="code" href="class_graph.html#a4d5abd78dd24ea71dbf50e1b0284d4b3">Graph&lt;T&gt;::dfsVisit</a>() {
<a name="l00408"></a>00408         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::const_iterator it= vertexSet.begin();
<a name="l00409"></a>00409         <span class="keyword">typename</span> vector&lt;Vertex&lt;T&gt;*&gt;::const_iterator ite= vertexSet.end();
<a name="l00410"></a>00410         <span class="keywordflow">for</span> (; it !=ite; it++)
<a name="l00411"></a>00411                 (*it)-&gt;visited=<span class="keyword">false</span>;
<a name="l00412"></a>00412         it=vertexSet.begin();
<a name="l00413"></a>00413         <span class="keywordflow">for</span> (; it !=ite; it++)
<a name="l00414"></a>00414             <span class="keywordflow">if</span> ( (*it)-&gt;visited==<span class="keyword">false</span> ){
<a name="l00415"></a>00415                 (*it)-&gt;processing = <span class="keyword">true</span>;
<a name="l00416"></a>00416                 dfsVisit(*it);
<a name="l00417"></a>00417                 (*it)-&gt;processing = <span class="keyword">false</span>;
<a name="l00418"></a>00418             }
<a name="l00419"></a>00419 }
<a name="l00420"></a>00420 
<a name="l00421"></a>00421 <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;
<a name="l00422"></a><a class="code" href="class_graph.html#a167172d4ecb3f4998caaaf370724b536">00422</a> <span class="keywordtype">void</span> <a class="code" href="class_graph.html#a4d5abd78dd24ea71dbf50e1b0284d4b3">Graph&lt;T&gt;::dfsVisit</a>(<a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a> *v) {
<a name="l00423"></a>00423         v-&gt;<a class="code" href="class_vertex.html#a187a2fe4ff50261cf3c15b8cda7dfc56">visited</a> = <span class="keyword">true</span>;
<a name="l00424"></a>00424         <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator it= (v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>).begin();
<a name="l00425"></a>00425         <span class="keyword">typename</span> vector&lt;Edge&lt;T&gt; &gt;::iterator ite= (v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>).end();
<a name="l00426"></a>00426         <span class="keywordflow">for</span> (; it !=ite; it++) {
<a name="l00427"></a>00427                 <span class="keywordflow">if</span> ( it-&gt;dest-&gt;processing == <span class="keyword">true</span>) numCycles++;
<a name="l00428"></a>00428             <span class="keywordflow">if</span> ( it-&gt;dest-&gt;visited == <span class="keyword">false</span> ){
<a name="l00429"></a>00429                 dfsVisit(it-&gt;dest);
<a name="l00430"></a>00430             }
<a name="l00431"></a>00431         }
<a name="l00432"></a>00432 }
<a name="l00433"></a>00433 
<a name="l00434"></a>00434 <span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;
<a name="l00435"></a><a class="code" href="class_graph.html#a2e75512c089c3916dda9cf61e1185d9d">00435</a> vector&lt;T&gt; <a class="code" href="class_graph.html#a2e75512c089c3916dda9cf61e1185d9d">Graph&lt;T&gt;::topologicalOrder</a>() {
<a name="l00436"></a>00436         <span class="comment">//vector com o resultado da ordenacao</span>
<a name="l00437"></a>00437         vector&lt;T&gt; res;
<a name="l00438"></a>00438 
<a name="l00439"></a>00439         <span class="comment">//verificar se � um DAG</span>
<a name="l00440"></a>00440         <span class="keywordflow">if</span>( getNumCycles() &gt; 0 ) {
<a name="l00441"></a>00441                 cout &lt;&lt; <span class="stringliteral">&quot;Ordenacao Impossivel!&quot;</span> &lt;&lt; endl;
<a name="l00442"></a>00442                 <span class="keywordflow">return</span> res;
<a name="l00443"></a>00443         }
<a name="l00444"></a>00444 
<a name="l00445"></a>00445         <span class="comment">//garantir que os &quot;indegree&quot; estao inicializados correctamente</span>
<a name="l00446"></a>00446         this-&gt;resetIndegrees();
<a name="l00447"></a>00447 
<a name="l00448"></a>00448         queue&lt;Vertex&lt;T&gt;*&gt; q;
<a name="l00449"></a>00449 
<a name="l00450"></a>00450         vector&lt;Vertex&lt;T&gt;*&gt; sources = getSources();
<a name="l00451"></a>00451         <span class="keywordflow">while</span>( !sources.empty() ) {
<a name="l00452"></a>00452                 q.push( sources.back() );
<a name="l00453"></a>00453                 sources.pop_back();
<a name="l00454"></a>00454         }
<a name="l00455"></a>00455         cout &lt;&lt; q.size() &lt;&lt; endl;
<a name="l00456"></a>00456 
<a name="l00457"></a>00457         <span class="comment">//processar fontes</span>
<a name="l00458"></a>00458         <span class="keywordflow">while</span>( !q.empty() ) {
<a name="l00459"></a>00459                 <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a>* v = q.front();
<a name="l00460"></a>00460                 q.pop();
<a name="l00461"></a>00461 
<a name="l00462"></a>00462                 res.push_back(v-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>);
<a name="l00463"></a>00463 
<a name="l00464"></a>00464                 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>.size(); i++) {
<a name="l00465"></a>00465                         v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>[i].dest-&gt;indegree--;
<a name="l00466"></a>00466                         <span class="keywordflow">if</span>( v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>[i].dest-&gt;indegree == 0) q.push( v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>[i].dest );
<a name="l00467"></a>00467                 }
<a name="l00468"></a>00468         }
<a name="l00469"></a>00469 
<a name="l00470"></a>00470         <span class="comment">//testar se o procedimento foi bem sucedido</span>
<a name="l00471"></a>00471         <span class="keywordflow">if</span> ( res.size() != vertexSet.size() ) {
<a name="l00472"></a>00472                 <span class="keywordflow">while</span>( !res.empty() ) res.pop_back();
<a name="l00473"></a>00473         }
<a name="l00474"></a>00474 
<a name="l00475"></a>00475         <span class="comment">//garantir que os &quot;indegree&quot; ficam actualizados ao final</span>
<a name="l00476"></a>00476         this-&gt;resetIndegrees();
<a name="l00477"></a>00477 
<a name="l00478"></a>00478         <span class="keywordflow">return</span> res;
<a name="l00479"></a>00479 }
<a name="l00480"></a>00480 
<a name="l00481"></a>00481 
<a name="l00482"></a>00482 
<a name="l00483"></a>00483 <span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;
<a name="l00484"></a><a class="code" href="class_graph.html#ab4054ca572c10669dd3e05d6d41c116c">00484</a> vector&lt;T&gt; <a class="code" href="class_graph.html#ab4054ca572c10669dd3e05d6d41c116c">Graph&lt;T&gt;::getPath</a>(<span class="keyword">const</span> T &amp;origin, <span class="keyword">const</span> T &amp;dest){
<a name="l00485"></a>00485 
<a name="l00486"></a>00486         list&lt;T&gt; buffer;
<a name="l00487"></a>00487         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a>* v = getVertex(dest);
<a name="l00488"></a>00488 
<a name="l00489"></a>00489         <span class="comment">//cout &lt;&lt; v-&gt;info &lt;&lt; &quot; &quot;;</span>
<a name="l00490"></a>00490         buffer.push_front(v-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>);
<a name="l00491"></a>00491         <span class="keywordflow">while</span> ( v-&gt;<a class="code" href="class_vertex.html#abd40febd917aa25add6bd42237c8463a">path</a> != NULL &amp;&amp;  v-&gt;<a class="code" href="class_vertex.html#abd40febd917aa25add6bd42237c8463a">path</a>-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a> != origin) {
<a name="l00492"></a>00492                 v = v-&gt;<a class="code" href="class_vertex.html#abd40febd917aa25add6bd42237c8463a">path</a>;
<a name="l00493"></a>00493                 buffer.push_front(v-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>);
<a name="l00494"></a>00494         }
<a name="l00495"></a>00495         <span class="keywordflow">if</span>( v-&gt;<a class="code" href="class_vertex.html#abd40febd917aa25add6bd42237c8463a">path</a> != NULL )
<a name="l00496"></a>00496                 buffer.push_front(v-&gt;<a class="code" href="class_vertex.html#abd40febd917aa25add6bd42237c8463a">path</a>-&gt;<a class="code" href="class_vertex.html#a415d7811eef6cdd992f0dca1f35a49cd">info</a>);
<a name="l00497"></a>00497 
<a name="l00498"></a>00498 
<a name="l00499"></a>00499         vector&lt;T&gt; res;
<a name="l00500"></a>00500         <span class="keywordflow">while</span>( !buffer.empty() ) {
<a name="l00501"></a>00501                 res.push_back( buffer.front() );
<a name="l00502"></a>00502                 buffer.pop_front();
<a name="l00503"></a>00503         }
<a name="l00504"></a>00504         <span class="keywordflow">return</span> res;
<a name="l00505"></a>00505 }
<a name="l00506"></a>00506 
<a name="l00507"></a>00507 
<a name="l00508"></a>00508 
<a name="l00509"></a>00509 <span class="keyword">template</span>&lt;<span class="keyword">class</span> T&gt;
<a name="l00510"></a><a class="code" href="class_graph.html#a445a38cf4045797198eae2b818b602de">00510</a> <span class="keywordtype">void</span> <a class="code" href="class_graph.html#a445a38cf4045797198eae2b818b602de">Graph&lt;T&gt;::dijkstraShortestPath</a>(<span class="keyword">const</span> T &amp;s) {
<a name="l00511"></a>00511 
<a name="l00512"></a>00512         <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; vertexSet.size(); i++) {
<a name="l00513"></a>00513                 vertexSet[i]-&gt;path = NULL;
<a name="l00514"></a>00514                 vertexSet[i]-&gt;dist = <a class="code" href="_graph_8h.html#a9fff7b07b84324efa12018456a60d91b">INT_INFINITY</a>;
<a name="l00515"></a>00515                 vertexSet[i]-&gt;processing = <span class="keyword">false</span>;
<a name="l00516"></a>00516         }
<a name="l00517"></a>00517 
<a name="l00518"></a>00518         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a>* v = getVertex(s);
<a name="l00519"></a>00519         v-&gt;<a class="code" href="class_vertex.html#ab2e06daa1acc81f7bd75f3d45c73a49a">dist</a> = 0;
<a name="l00520"></a>00520 
<a name="l00521"></a>00521         vector&lt; Vertex&lt;T&gt;* &gt; pq;
<a name="l00522"></a>00522         pq.push_back(v);
<a name="l00523"></a>00523 
<a name="l00524"></a>00524         make_heap(pq.begin(), pq.end());
<a name="l00525"></a>00525 
<a name="l00526"></a>00526 
<a name="l00527"></a>00527         <span class="keywordflow">while</span>( !pq.empty() ) {
<a name="l00528"></a>00528 
<a name="l00529"></a>00529                 v = pq.front();
<a name="l00530"></a>00530                 pop_heap(pq.begin(), pq.end());
<a name="l00531"></a>00531                 pq.pop_back();
<a name="l00532"></a>00532 
<a name="l00533"></a>00533                 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>.size(); i++) {
<a name="l00534"></a>00534                         <a class="code" href="class_vertex.html">Vertex&lt;T&gt;</a>* w = v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>[i].dest;
<a name="l00535"></a>00535 
<a name="l00536"></a>00536                         <span class="keywordflow">if</span>(v-&gt;<a class="code" href="class_vertex.html#ab2e06daa1acc81f7bd75f3d45c73a49a">dist</a> + v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>[i].weight &lt; w-&gt;<a class="code" href="class_vertex.html#ab2e06daa1acc81f7bd75f3d45c73a49a">dist</a> ) {
<a name="l00537"></a>00537 
<a name="l00538"></a>00538                                 w-&gt;<a class="code" href="class_vertex.html#ab2e06daa1acc81f7bd75f3d45c73a49a">dist</a> = v-&gt;<a class="code" href="class_vertex.html#ab2e06daa1acc81f7bd75f3d45c73a49a">dist</a> + v-&gt;<a class="code" href="class_vertex.html#a5d9dfdd2caee11e300ff5142799345a1">adj</a>[i].weight;
<a name="l00539"></a>00539                                 w-&gt;<a class="code" href="class_vertex.html#abd40febd917aa25add6bd42237c8463a">path</a> = v;
<a name="l00540"></a>00540 
<a name="l00541"></a>00541                                 <span class="comment">//se j� estiver na lista, apenas a actualiza</span>
<a name="l00542"></a>00542                                 <span class="keywordflow">if</span>(!w-&gt;<a class="code" href="class_vertex.html#ae575d4b9a6b1ada3f9626c458c060f54">processing</a>)
<a name="l00543"></a>00543                                 {
<a name="l00544"></a>00544                                         w-&gt;<a class="code" href="class_vertex.html#ae575d4b9a6b1ada3f9626c458c060f54">processing</a> = <span class="keyword">true</span>;
<a name="l00545"></a>00545                                         pq.push_back(w);
<a name="l00546"></a>00546                                 }
<a name="l00547"></a>00547 
<a name="l00548"></a>00548                                 make_heap (pq.begin(),pq.end(),<a class="code" href="structvertex__greater__than.html">vertex_greater_than&lt;int&gt;</a>());
<a name="l00549"></a>00549                         }
<a name="l00550"></a>00550                 }
<a name="l00551"></a>00551         }
<a name="l00552"></a>00552 }
<a name="l00553"></a>00553 
<a name="l00554"></a>00554 
<a name="l00555"></a>00555 
<a name="l00556"></a>00556 
<a name="l00557"></a>00557 <span class="preprocessor">#endif </span><span class="comment">/* GRAPH_H_ */</span>
<a name="l00558"></a>00558 
<a name="l00559"></a>00559 
</pre></div></div>
</div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><a class="el" href="_graph_8h.html">Graph.h</a>      </li>
      <li class="footer">Gerado em Fri May 13 2011 02:00:24 para Grupo12daturma2MIEIC4 por&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>Tudo</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Ficheiros</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Funções</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variáveis</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Amigos</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Macros</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>


</body>
</html>
